Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
541	The Self-organization of Time and Causality: steps towards understanding the ultimate origin Francis Heylighen Evolution, Complexity and Cognition Group, Vrije Universiteit Brussel Add to Reading List Source URL: pcp.vub.ac.be Language: English - Date: 2014-05-02 12:27:31 Causality Physical cosmology Philosophy of physics Theology Causal sets Francis Heylighen Indeterminism Determinism Self-organization Physics Science Philosophy of science
542	CE N T R E FO R ST R ATEG IC FU T U R E S SIGHT 2014 Add to Reading List Source URL: europa.eu Language: English - Date: 2014-08-13 06:21:24 Anticipatory thinking Futurology Systems Foresight Transhumanism Complexity Scenario planning Wicked problem Complex systems Time Science Management
543	Foundations of Machine Learning Lecture 2 Mehryar Mohri Courant Institute and Google Research Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2014-09-22 09:09:12 Computational learning theory Learning Probably approximately correct learning Mehryar Mohri Mohri Computational complexity theory Generalization error Algorithm Time complexity Theoretical computer science Applied mathematics Machine learning
544	Random Sampling with a Reservoir JEFFREY SCOTT VITTER Brown University We introduce fast algorithms for selecting a random sample of n records without replacement from a pool of N records, where the value of N is unknown Add to Reading List Source URL: www.mathcs.emory.edu Language: English - Date: 2005-10-15 23:23:14 Analysis of algorithms Randomized algorithm Big O notation Time complexity Expectation–maximization algorithm Pseudo-random number sampling Theoretical computer science Mathematics Applied mathematics
545	Modeling Computational Security in Long-Lived Systems, Version 2 Ran Canetti1,2 , Ling Cheung2 , Dilsun Kaynar3 , Nancy Lynch2 , and Olivier Pereira4 1 2 IBM T. J. Watson Research Center Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-11-23 13:22:28 Analysis of algorithms IP PP Randomized algorithm Dynamical system Time complexity Theoretical computer science Computational complexity theory Applied mathematics
546	Approximating Independent Set in Semi-Random Graphs Bodo Manthey a Kai Plociennik b a University of Twente, Department of Applied Mathematics Add to Reading List Source URL: doc.utwente.nl Language: English - Date: 2011-08-28 15:19:04 NP-complete problems Analysis of algorithms Approximation algorithms Time complexity Independent set Ε-net Property testing Theoretical computer science Mathematics Computational complexity theory
547	Sketching and Streaming High-Dimensional Vectors by Jelani Nelson S.B., Massachusetts Institute of Technology (2005) Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2011-09-15 11:01:01 Algorithms Streaming algorithm Analysis of algorithms Time complexity Entropy Johnson–Lindenstrauss lemma Theoretical computer science Applied mathematics Mathematics
548	Towards Ecient Universal Planning\|A Randomized Approach Peter Jonsson, Patrik Haslum and Christer Backstrom Department of Computer and Information Science Linkoping University, S[removed]Linkoping, Sweden fpetej,paha Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2012-02-01 04:30:41 Applied mathematics Polynomial hierarchy P SL L NC Time complexity FO Completeness Theoretical computer science Computational complexity theory Complexity classes
549	Solving LWE problem with bounded errors in polynomial time Jintai Ding1,2 Southern Chinese University of Technology, 1 University of Cincinnati, 2 [removed] Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-11-02 07:13:56 Cryptography Computational complexity theory Information theory Models of computation Learning with errors Lattice problem Quantum computer PP Low Theoretical computer science Applied mathematics Mathematics
550	ALGORITHMS FOR BOOLEAN FUNCTION QUERY PROPERTIES SCOTT AARONSON∗ Abstract. We investigate efficient algorithms for computing Boolean function properties relevant to query complexity. Such properties include, for exampl Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2006-11-24 03:47:48 Computational complexity theory Analysis of algorithms Boolean algebra Complexity classes Decision tree model Time complexity Circuit complexity Randomized algorithm Circuit Theoretical computer science Applied mathematics Mathematics

UPDATE